Additive rules for the quasi-linear bargaining problem

نویسندگان

  • Christopher P. Chambers
  • Jerry R. Green
چکیده

We study the class of additive rules for the quasi-linear bargaining problem introduced by Green. We provide a characterization of the class of all rules that are efficient, translation invariant, additive, and continuous. We present two subfamilies of rules which are nested in each other: the one parameter family of t-Shapley rules and the larger family of weighted coalitional rules, and we discuss additional properties that solutions in these families possess.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A fuzzy multi-objective model for a project management problem

In this research, the multi-objective project management decision problem with fuzzy goals and fuzzy constraints are considered. We constitute α-cut approach and two various fuzzy goal programming solution methods for solving the Multi-Objective Project Management (MOPM) decision problem under fuzzy environments. The Interactive fuzzy multi-objective linear programming (i-FMOLP) and Weighted Ad...

متن کامل

Employing a Multi-Criteria Approach under Bankruptcy Conditions for Optimal Allocation of Shared Water Resources through Using Asymmetric Nash Bargaining Method

Management based on the flexibility, fairness, and sustainability characteristics of water resources may play a key role in preventing the continuation of the crisis process as well as reducing water users’ conflict. In the present research, the framework for the optimal allocation of shared water resources was presented using a combination of bankruptcy concepts and asymmetric Nash bargaining....

متن کامل

A Relation between the Protocol Partition Number and the Quasi-Additive Bound

In this note, we show that the linear programming for computing the quasi-additive bound of the formula size of a Boolean function presented by Ueno [MFCS’10] is equivalent to the dual problem of the linear programming relaxation of an integer programming for computing the protocol partition number. Together with the result of Ueno [MFCS’10], our results imply that there exists no gap between o...

متن کامل

Vehicle Routing Problem in Competitive Environment: Two-Person Nonzero Sum Game Approach

Vehicle routing problem is one of the most important issues in transportation. Among VRP problems, the competitive VRP is more important because there is a tough competition between distributors and retailers. In this study we introduced new method for VRP in competitive environment. In these methods Two-Person Nonzero Sum games are defined to choose equilibrium solution. Therefore, revenue giv...

متن کامل

Measuring the efficiency of Iranian electricity distribution companies, a combined approach to bargaining game with DEA

 Many models have been proposed for measuring performance of business agencies up to now. The goal of this research is providing a new approach for evaluation and measurement of efficiencies of national power distribution companies. This approach is provided as a combination of Data Envelopment Analysis (DEA) and Game Theory for evaluation of decision-making units by a large scale of actions. I...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004